The Syntax and Semantics of timed CRL Jan Friso
نویسندگان
چکیده
We de ne a speci cation language called `timed CRL'. This language is designed to describe communicating processes employing data and time. Timed CRL is the successor of CRL [17]. It di ers in two main aspects. It is possible to make explicit reference to time using a new `at' operator; p,t is the process p where the rst action must take place at time t. Furthermore, a distinction has been made between constructors and functions in the datatypes. Care has been taken that every CRL speci cation is also a correct timed CRL speci cation with exactly the same meaning. 1991 Mathematics Subject Classi cation: 68M99, 68N99 1991 Computing Reviews Classi cation System: D.2.1, D.3.1, D.3.3
منابع مشابه
The Syntax and Semantics of Timed $mu Crl$ the Syntax and Semantics of Timed Crl
We deene a speciication language called`timed CRL'. This language is designed to describe communicating processes employing data and time. Timed CRL is the successor of CRL 17]. It diiers in two main aspects. It is possible to make explicit reference to time using a newàt' operator; p,t is the process p where the rst action must take place at time t. Furthermore, a distinction has been made bet...
متن کاملSen - R 9709 1997
We deene a speciication language called`timed CRL'. This language is designed to describe communicating processes employing data and time. Timed CRL is the successor of CRL 17]. It diiers in two main aspects. It is possible to make explicit reference to time using a newàt' operator; p,t is the process p where the rst action must take place at time t. Furthermore, a distinction has been made bet...
متن کاملCompleteness of Timed mCRL
In [9], a straightforward extension of the process algebra μCRL was proposed to explicitly deal with time. The process algebra μCRL has been designed especially to deal with data in a process algebraic context. Using the features for data, only a minor extension of the language was needed to obtain a very expressive variant of time. But [9] contains syntax, operational semantics and axioms char...
متن کاملBasic Theorems for Parallel Processes in Timed CRL
Timed CRL is a process algebra-based formalism for the speci cation and veri cation of parallel,communicating systems with explicit time [5]. In this paper various basic results are derived, suchas theorems for basic forms, the expansion of terms with operators for parallelism, eliminationof parallelism, and commutativity and associativity of the merge and communication merge (the<l...
متن کاملCompleteness of Timed CRL
In [9], a straightforward extension of the process algebra μCRL was proposed to explicitly deal with time. The process algebra μCRL has been designed especially to deal with data in a process algebraic context. Using the features for data, only a minor extension of the language was needed to obtain a very expressive variant of time. But [9] contains syntax, operational semantics and axioms char...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997